Generalized Ideals and Co-granular Rough Sets

نویسنده

  • A. Mani
چکیده

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the present author and associated semantic features are investigated by her. Granules are used in the construction of approximations in implicit ways and so a concept of co-granularity is introduced. Knowledge interpretation associable with the approaches is also investigated. This research will be of relevance for a number of logico-algebraic approaches to rough sets that proceed from point-wise definitions of approximations and also for using alternative approximations in spatial mereological contexts involving actual contact relations. The antichain based semantics invented in earlier papers by the present author also applies to the contexts considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rough sets induced by ideals in lattices

This paper is to study the rough sets within the context of lattices. We study the special properties of the rough sets which can be constructed by means of the congruences determined by ideals of lattice. Also the properties of the generalized rough sets with respect to ideals of lattice are investigated. Finally we give an example of their application in formal concept analysis. 2014 Elsevier...

متن کامل

A Model of Granular Computing on Binary Relations Based on Generalized Rough Set and Its Granulation in Information System

Granular computing is a new information processing method. Many models and methods of granular computing have been proposed and studied. Nowadays, the granular computing has been appeared in many areas of information processing. In this paper, a study of the model of granular computing on Binary Relations based on Generalized Rough Set is presented. We hope to expand the range of application of...

متن کامل

Generalized rough sets via ideals

The aim of this paper to construct a new rough set structure for a given ideal and to study many of their properties. 2010 AMS Classification: 54A05, 54H99

متن کامل

TOPOLOGICAL SIMILARITY OF L-RELATIONS

$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...

متن کامل

Stratified Rough Sets and Vagueness

The relationship between less detailed and more detailed versions of data is one of the major issues in processing geographic information. Fundamental to much work in model-oriented generalization, also called semantic generalization, is the notion of an equivalence relation. Given an equivalence relation on a set, the techniques of rough set theory can be applied to give generalized descriptio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017